Efficient Multi-Channel Signal Strength Based Localization via Matrix Completion and Bayesian Sparse Learning
نویسندگان
چکیده
منابع مشابه
Preprocessing sparse semidefinite programs via matrix completion
Considering that preprocessing is an important phase in linear programming, it should be systematically more incorporated in semidefinite programming solvers. The conversion method proposed by the authors (SIAM Journal on Optimization, vol. 11, pp. 647–674, 2000, and Mathematical Programming, Series B, vol. 95, pp. 303–327, 2003) is a preprocessing of sparse semidefinite programs based on matri...
متن کاملLearning Translations via Matrix Completion
Bilingual Lexicon Induction is the task of learning word translations without bilingual parallel corpora. We model this task as a matrix completion problem, and present an effective and extendable framework for completing the matrix. This method harnesses diverse bilingual and monolingual signals, each of which may be incomplete or noisy. Our model achieves state-of-the-art performance for both...
متن کاملEfficient Spatial Variation Characterization via Matrix Completion
In this paper, we propose a novel method to estimate and characterize spatial variations on dies or wafers. This new technique exploits recent developments in matrix completion, enabling estimation of spatial variation across wafers or dies with a small number of randomly picked sampling points while still achieving fairly high accuracy. This new approach can be easily generalized, including fo...
متن کاملSparse Bayesian Multi-Task Learning
We propose a new sparse Bayesian model for multi-task regression and classification. The model is able to capture correlations between tasks, or more specifically a low-rank approximation of the covariance matrix, while being sparse in the features. We introduce a general family of group sparsity inducing priors based on matrix-variate Gaussian scale mixtures. We show the amount of sparsity can...
متن کاملFast and Provable Algorithms for Spectrally Sparse Signal Reconstruction via Low-Rank Hankel Matrix Completion
A spectrally sparse signal of order r is a mixture of r damped or undamped complex sinusoids. This paper investigates the problem of reconstructing spectrally sparse signals from a random subset of n regular time domain samples, which can be reformulated as a low rank Hankel matrix completion problem. We introduce an iterative hard thresholding (IHT) algorithm and a fast iterative hard threshol...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Mobile Computing
سال: 2015
ISSN: 1536-1233
DOI: 10.1109/tmc.2015.2393864